Balancing Sparsity and Rank Constraints in Quadratic Basis Pursuit
نویسندگان
چکیده
We investigate the methods that simultaneously enforce sparsity and low-rank structure in a matrix as often employed for sparse phase retrieval problems or phase calibration problems in compressive sensing. We propose a new approach for analyzing the trade off between the sparsity and low rank constraints in these approaches which not only helps to provide guidelines to adjust the weights between the aforementioned constraints, but also enables new simulation strategies for evaluating performance. We then provide simulation results for phase retrieval and phase calibration cases both to demonstrate the consistency of the proposed method with other approaches and to evaluate the change of performance with different weights for the sparsity and low rank structure constraints.
منابع مشابه
An Efficient Algorithm for Sparse Representations
Basis Pursuit (BP) and Basis Pursuit Denoising (BPDN), well established techniques for computing sparse representations, minimize an ` data fidelity term, subject to an ` sparsity constraint or regularization term, by mapping the problem to a linear or quadratic program. BPDN with an ` data fidelity term has recently been proposed, also implemented via a mapping to a linear program. We introduc...
متن کاملSparse Optimization with Least - Squares Constraints Ewout
The use of convex optimization for the recovery of sparse signals from incomplete or compressed data is now common practice. Motivated by the success of basis pursuit in recovering sparse vectors, new formulations have been proposed that take advantage of different types of sparsity. In this paper we propose an efficient algorithm for solving a general class of sparsifying formulations. For sev...
متن کاملConvex relaxations of structured matrix factorizations
We consider the factorization of a rectangular matrix X into a positive linear combination of rank-one factors of the form uv, where u and v belongs to certain sets U and V , that may encode specific structures regarding the factors, such as positivity or sparsity. In this paper, we show that computing the optimal decomposition is equivalent to computing a certain gauge function of X and we pro...
متن کاملReducing Health Inequities Through Intersectoral Action: Balancing Equity in Health With Equity for Other Social Goods
Significant attention has been devoted to developing intersectoral strategies to reduce health inequities; however, these strategies have largely neglected to consider how equity in health ought to be weighted and balanced with the pursuit of equity for other social goods (eg, education equity). Research in this domain is crucial, as the health sector’s pursuit of health equity may be at odds w...
متن کاملSimultaneous Sparse Approximation : insights and algorithms
This paper addresses the problem of simultaneous sparse approximation of signals, given an overcomplete dictionary of elementary functions, with a joint sparsity profile induced by a lp − lq mixednorm. Our contributions are essentially two-fold i) making connections between such an approach and other methods available in the literature and ii) on providing algorithms for solving the problem wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1403.4267 شماره
صفحات -
تاریخ انتشار 2014